class Solution {
public:
    int minFallingPathSum(vector<vector<int>>& g) {
        int n = g.size();
        vector<vector<int>> dp(n + 1, vector<int>(n + 2, INT_MAX));
        for (int i = 0; i < n + 2; i++) dp[0][i] = 0;
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= n; j++) {
                dp[i][j] = min({ dp[i - 1][j - 1],dp[i - 1][j],dp[i - 1][j + 1] }) + g[i - 1][j - 1];
            }
        }
        int ans = INT_MAX;
        for (int i = 1; i <= n; i++) ans = min(ans, dp[n][i]);
        return ans;
    }
};